On the tradeoff between economic efficiency and strategy proofness in randomized social choice
نویسندگان
چکیده
Two fundamental notions in microeconomic theory are efficiency—no agent can be made better off without making another one worse off—and strategyproofness—no agent can obtain a more preferred outcome by misrepresenting his preferences. When social outcomes are probability distributions (or lotteries) over alternatives, there are varying degrees of these notions depending on how preferences over alternatives are extended to preference over lotteries. We show that efficiency and strategyproofness are incompatible to some extent when preferences are defined using stochastic dominance (SD) and therefore introduce a natural weakening of SD based on Savage’s sure-thing principle (ST). While random serial dictatorship is SD-strategyproof, it only satisfies ST-efficiency. Our main result is that strict maximal lotteries—an appealing class of social decision schemes due to Kreweras and Fishburn—satisfy SD-efficiency and STstrategyproofness.
منابع مشابه
Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
In this paper, we consider a relationship between equity and efficiency in queueing problems. We show that under strategy-proofness, anonymity in welfare implies queue-efficiency. Furthermore, we also give a characterization of the equally distributed pairwise pivotal rule, as the only rule that satisfies strategy-proofness, anonymity in welfare and budget-balance. keywords: Queueing Problems, ...
متن کاملDomains of Social Choice Functions on Which Coalition Strategy-proofness and Maskin Monotonicity Are Equivalent
It is known that on some social choice and economic domains, a social choice function is coalition strategy-proof if and only if it is Maskin monotonic (e.g. Muller and Satterthwaite, 1977). This paper studies the foundation of those results. I provide a set of conditions which is sufficient for the equivalence between coalition strategy-proofness and Maskin monotonicity. This generalizes some ...
متن کاملImpossibilities for probabilistic assignment
We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...
متن کاملSome Results for Impossibility Theorems of Social Welfare Function and Social Choice Function
We present some results on social welfare function and social choice function. First, we replace weak Pareto principle of Arrow’s axioms with strong Pareto principle, and then show that assuming unrestricted domain property, independence of irrelevant alternatives and strong Pareto principle on a social welfare function in Arrow’s sense leads to the existence of first to nth commanders whose st...
متن کاملPairwise partition graphs and strategy-proof social choice in the exogenous indifference class model
In this paper we consider the exogenous indifference classes model of Barberá and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results. The key to our approach is the pairwise partition graph. We provide necessary conditions on these graphs for strategy-proofness and unanimity (or efficiency) to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013